GCD matrices, posets, and nonintersecting paths

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Gcd Matrices, Posets, and Nonintersecting Paths

We show that with any finite partially ordered set, P , one can associate a matrix whose determinant factors nicely. As corollaries, we obtain a number of results in the literature about GCD matrices and their relatives. Our main theorem is proved combinatorially using nonintersecting paths in a directed graph.

متن کامل

Nonintersecting Paths, Pfaffians, and Plane Partitions

Gessel and Viennot have developed a powerful technique for enumerating various classes of plane partitions [GVl, 21. There are two fundamental ideas behind this technique. The first is the observation that most classes of plane partitions that are of interest--either by association with the representation theory of the classical groups, or for purely combinatorial reasons+an be interpreted as c...

متن کامل

Nonintersecting Brownian interfaces and Wishart random matrices.

We study a system of N nonintersecting (1+1)-dimensional fluctuating elastic interfaces ("vicious bridges") at thermal equilibrium, each subject to periodic boundary condition in the longitudinal direction and in presence of a substrate that induces an external confining potential for each interface. We show that, for a large system and with an appropriate choice of the external confining poten...

متن کامل

Counting Nonintersecting Lattice Paths with Turns

We derive enumeration formulas for families of nonintersecting lattice paths with given starting and end points and a given total number of North-East turns. These formulas are important for the computation of Hilbert series for determinantal and pfaffian rings.

متن کامل

Nonintersecting paths with a staircase initial condition ∗

We consider an ensemble of N discrete nonintersecting paths starting from equidistant points and ending at consecutive integers. Our first result is an explicit formula for the correlation kernel that allows us to analyze the process as N → ∞. In that limit we obtain a new general class of kernels describing the local correlations close to the equidistant starting points. As the distance betwee...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear and Multilinear Algebra

سال: 2005

ISSN: 0308-1087,1563-5139

DOI: 10.1080/03081080500054612